1013B - And - CodeForces Solution

import sys
from collections import Counter

def min_operations(n, x, arr):
        counter = Counter(arr)
    
        if any(count >= 2 for count in counter.values()):
        return 0
    
        for num in arr:
        new_num = num & x
        if new_num != num and new_num in counter:
            return 1
    
        seen = set()
    for num in arr:
        new_num = num & x
        if new_num in seen:
            return 2
        else:
            seen.add(new_num)
    
        return -1

n, x = map(int, input().split())
arr = list(map(int, input().split()))

print(min_operations(n, x, arr))